Papers on Algorithms and Complexity

1.      Foldings, graphs of groups and the membership problem (with I. Kapovich and R. Weidmann). Internat. Journal Algebra Comput , to appear.

 

2.      Generic-case complexity and decision problems in group theory (with I. Kapovich, P. Schupp and V.Shpilrain). J. of Algebra, 264 (2003), 665-694.

 

3.      Stallings foldings and subgroups of free groups (with I. Kapovich). J. of Algebra, 248 (2002), 608-668.

 

4.      Aspects of the theory of free groups (with K. Bencsath, B. Fine, A. Gaglione, G. Rosenberger and D. Spellman). Algorithmic problems in groups and semigroups (Lincoln, NE, 1998), 35--50, Trends Math., Birkhäuser Boston, Boston, MA, 2000.

 

5.      Malnormality is decidable in free groups (with G.Baumslag, A.Myasnikov and V.Remeslennikov). Internat. Journal Algebra Comput. 9 (1999), no.6, 687-692.